ON THE NUMBER OF DIVISORS OF n! AND OF THE FIBONACCI NUMBERS
نویسندگان
چکیده
Let d(m) be the number of divisors of the positive integer m. Here, we show that if n 6∈ {3, 5}, then d(n!) is a divisor of n!. We also show that the only positive integers n such that d(Fn) divides Fn, where Fn is the nth Fibonacci number, are n ∈ {1, 2, 3, 6, 24, 48}.
منابع مشابه
A remark on the means of the number of divisors
We obtain the asymptotic expansion of the sequence with general term $frac{A_n}{G_n}$, where $A_n$ and $G_n$ are the arithmetic and geometric means of the numbers $d(1),d(2),dots,d(n)$, with $d(n)$ denoting the number of positive divisors of $n$. Also, we obtain some explicit bounds concerning $G_n$ and $frac{A_n}{G_n}$.
متن کاملHyers-Ulam stability of K-Fibonacci functional equation
Let denote by Fk,n the nth k-Fibonacci number where Fk,n = kFk,n−1+Fk,n−2 for n 2 with initial conditions Fk,0 = 0, Fk,1 = 1, we may derive a functionalequation f(k, x) = kf(k, x − 1) + f(k, x − 2). In this paper, we solve thisequation and prove its Hyere-Ulam stability in the class of functions f : N×R ! X,where X is a real Banach space.
متن کاملThe (non-)existence of perfect codes in Lucas cubes
A Fibonacci string of length $n$ is a binary string $b = b_1b_2ldots b_n$ in which for every $1 leq i < n$, $b_icdot b_{i+1} = 0$. In other words, a Fibonacci string is a binary string without 11 as a substring. Similarly, a Lucas string is a Fibonacci string $b_1b_2ldots b_n$ that $b_1cdot b_n = 0$. For a natural number $ngeq1$, a Fibonacci cube of dimension $n$ is denoted by $Gamma_n$ and i...
متن کاملOn Positive Numbers U For
Let n be a positive integer n and let uj(n), 0 (n) 3 r (n) ? (n) and a(n) be the classical arithmetic functions of n. That is, cj(n), fi(n), and r(n) count the number of distinct prime divisors of n, the total number of prime divisors of n, and the number of divisors of n, respectively, while 4>(n) and a(n) are the Euler function of n and the sum of divisors function of n respectively. A lot...
متن کاملA Survey on Practical Numbers
A positive integer m is said to be practical if every integer n 2 (1; m) is a sum of distinct positive divisors of m: In this paper we give an equivalent deenition of practical number, and describe some arithmetical properties of practical numbers showing a remarkable analogy with primes. We give an improvement of the estimate of the gap between consecutive practical numbers and prove the exist...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012